One- and two-page crossing numbers for some types of graphs
نویسندگان
چکیده
منابع مشابه
One- and two-page crossing numbers for some types of graphs
The simplest graph drawing method is that of putting the vertices of a graph on a line (spine) and drawing the edges as half-circles on k half planes (pages). Such drawings are called k-page book drawings and the minimal number of edge crossings in such a drawing is called the k-page crossing number. In a one-page book drawing, all edges are placed on one side of the spine, and in a two-page bo...
متن کاملCrossing numbers of random graphs
An order type of the points x1, x2, ..., xn in the plane (with no three colinear) is a list of orientations of all triplet xixjxk, i < j < k. Let X be the set of all order types of the points x1, ..., xn in the plane. For any graph G with vertices v1, ..., vn let lin-crξ(G) denote the number of crossings in the straight line drawing of G, where vi is placed at xi in the plane and x1, ..., xn ha...
متن کاملCrossing numbers of imbalanced graphs
The crossing number, cr(G), of a graph G is the least number of crossing points in any drawing of G in the plane. According to the Crossing Lemma of Ajtai, Chvátal, Newborn, Szemerédi [ACNS82] and Leighton [L83], the crossing number of any graph with n vertices and e > 4n edges is at least constant times e/n. Apart from the value of the constant, this bound cannot be improved. We establish some...
متن کاملPfaffian graphs, T -joins and crossing numbers
We characterize Pfaffian graphs in terms of their drawings in the plane. We generalize the techniques used in the proof of this characterization, and prove a theorem about the numbers of crossings in T -joins in different drawings of a fixed graph. As a corollary we give a new proof of a theorem of Kleitman on the parity of crossings in drawings of K2j+1 and K2j+1,2k+1.
متن کاملMETA-HEURISTIC ALGORITHMS FOR MINIMIZING THE NUMBER OF CROSSING OF COMPLETE GRAPHS AND COMPLETE BIPARTITE GRAPHS
The minimum crossing number problem is among the oldest and most fundamental problems arising in the area of automatic graph drawing. In this paper, eight population-based meta-heuristic algorithms are utilized to tackle the minimum crossing number problem for two special types of graphs, namely complete graphs and complete bipartite graphs. A 2-page book drawing representation is employed for ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Mathematics
سال: 2010
ISSN: 0020-7160,1029-0265
DOI: 10.1080/00207160802524747